The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-2 Tensor∗
نویسندگان
چکیده
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful, but algorithms to do so exhibit unpleasantly interesting behavior known as swamps. Such swamps have been the bane of users for decades and need to be understood so they can be alleviated. In previous work, we developed and applied dynamical systems concepts to analyze the simplest nontrivial case of tensor approximation, which is a rank-1 tensor approximating a rank-2 tensor. Now we consider the next, perhaps most important, case of a rank-2 tensor approximating a rank-2 tensor. We find terminal swamps caused by ill-conditioned Hessians at the solution, and that these worsen for small angle; this mechanism is consistent with the literature and not surprising. We find transient swamps caused by descent along valleys emanating from essential singularities; this mechanism is surprising and not amenable to standard analysis, which explains why it has been so hard to identify.
منابع مشابه
The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor∗
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful. Unfortunately, algorithms to do so are not robust and regularly exhibit unpleasantly interesting behavior. A variety of different algorithms have been proposed with different features, but the state of the art is still unsatisfactory. In this work we step back from the algorithms a...
متن کاملTensor principal component analysis via convex optimization
This paper is concerned with the computation of the principal components for a general tensor, known as the tensor principal component analysis (PCA) problem. We show that the general tensor PCA problem is reducible to its special case where the tensor in question is supersymmetric with an even degree. In that case, the tensor can be embedded into a symmetric matrix. We prove that if the tensor...
متن کاملNew Ranks for Even-Order Tensors and Their Applications in Low-Rank Tensor Optimization
In this paper, we propose three new tensor decompositions for even-order tensors corresponding respectively to the rank-one decompositions of some unfolded matrices. Consequently such new decompositions lead to three new notions of (even-order) tensor ranks, to be called the M-rank, the symmetric M-rank, and the strongly symmetric M-rank in this paper. We discuss the bounds between these new te...
متن کاملun 2 00 9 Subtracting a best rank - 1 approximation may increase tensor rank
It has been shown that a best rank-R approximation of an order-k tensor may not exist when R ≥ 2 and k ≥ 3. This poses a serious problem to data analysts using tensor decompositions. It has been observed numerically that, generally, this issue cannot be solved by consecutively computing and subtracting best rank-1 approximations. The reason for this is that subtracting a best rank-1 approximati...
متن کاملBest Rank-One Tensor Approximation and Parallel Update Algorithm for CPD
A novel algorithm is proposed for CANDECOMP/PARAFAC tensor decomposition to exploit best rank-1 tensor approximation. Different from the existing algorithms, our algorithm updates rank-1 tensors simultaneously in-parallel. In order to achieve this, we develop new all-at-once algorithms for best rank-1 tensor approximation based on the Levenberg-Marquardt method and the rotational update. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017